Diverse Sorting Algorithm Analysis for ACSFD in Wireless Sensor Networks

The progression in wireless communications and electronics has emerged the expansion of low-cost sensor networks. Sensor networks exploit large number of wireless sensor nodes to collect information from their sensing terrain. The gathered information will undergo in-network process and send to the remote sink. Sensor networks have wide range of applications including medical, military, home, etc. In the sensor networks, a fault-tolerant distributed decision fusion will occur due to the presence of sensor faults. For this fault detection, Collaborative Sensor Fault Detection (CSFD) scheme was used and this fault detection scheme is very difficult to implement because of the extensive computations. So an Approximated Collaborative Sensor Fault Detection (ACSFD) scheme was developed, which is less cost and utilizes less power than CSFD and has the same performance of CSFD. The important blocks present in the architecture of ACSFD consist of multipliers, logarithms, and sorting. In this paper, analysis has been done with various sorting algorithms and concluded the best sorting technique that can be used in ACSFD scheme to improve the performance of the fault detection scheme in the wireless sensor